A Perspective on Lindström Quantifiers and Oracles
نویسنده
چکیده
منابع مشابه
Regular languages definable by Lindström quantifiers
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
متن کاملBranching of Fuzzy Quantifiers and Multiple Variable Binding: An Extension of DFS Theory
Lindström [11] introduced a very powerful notion of quantifiers, which permits multi-place quantification and the simultaneous binding of several variables. A special case, 'branching' quantifiers, was found to be useful in linguistics, specifically for modelling reciprocal constructions like " Most men and most women admire each other ". Westerståhl [13] showed how to compute the three-place L...
متن کاملLindström Quantifiers and Leaf Language Definability
We show that examinations of the expressive power of logical formulae enriched by Lindström quantifiers over ordered finite structures have a well-studied complexity-theoretic counterpart: the leaf language approach to define complexity classes. Model classes of formulae with Lindström quantifiers are nothing else than leaf language definable sets. Along the way we tighten the best up to now kn...
متن کاملGeneralized Quantifiers and Logical Reducibilities
We consider extensions of first order logic (FO) and least fixed point logic (LFP) with generalized quantifiers in the sense of Lindström [Lin66]. We show that adding a finite set of such quantifiers to LFP fails to capture all polynomial time properties of structures, even over a fixed signature. We show that this strengthens results in [Hel92] and [KV92a]. We also consider certain regular inf...
متن کاملSuccinct Inputs, Lindström Quantifiers, and a General Complexity Theoretic Operator Concept
We address the question of the power of several logics with Lindström quantifiers over finite ordered structures. We will see that in the first-order case this nicely fits into the framework of Barrington, Immerman, and Straubing’s examination of constant depth circuit classes. In the second-order case we get a strong relationship to succinct encodings of languages via circuits. Some of these l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997